Name Lookup in Ndn Using Knuth – Morris – Pratt Algorithm
نویسنده
چکیده
Named Data Networking (NDN) is the hot research topics for future Internet. It is the contrast model of traditional IP architecture. NDN gives more importance to content rather than the data hosts. It enables the end user to give a data content request with no knowledge about the hosting entity. It manages user mobility, highly secure, flexible and scalable than the conventional Internet. Though NDN has several advantages, it has some issues in the hardware aspects like name based lookup tables. The NDN names are hierarchical in nature and contain variable and unbounded lengths, which are very longer than IPv4/6 address; quicker name lookup process is an important issue needs to be addressed. This paper presents a Knuth–Morris–Pratt (KMP) algorithm for efficient and faster name lookups. The proposed method meets the needs of the NDN forwarding process include add, change and remove names easily. The experimental results investigate the memory and time consumption of the proposed method. The outcome depicts that proposed method performs well than the existing name lookup methods.
منابع مشابه
On Compile Time Knuth-Morris-Pratt Precomputation
Many keyword pattern matching algorithms use precomputation subroutines to produce lookup tables, which in turn are used to improve performance during the search phase. If the keywords to be matched are known at compile time, the precomputation subroutines can be implemented to be evaluated at compile time versus at run time. This will provide a performance boost to run time operations. We have...
متن کاملEfficient validation and construction of Knuth–Morris–Pratt arrays
Knuth-Morris-Pratt (KMP) arrays are known as the ”failure function” of the Knuth-Morris-Pratt string matching algorithm. We present an algorithm to check if an integer array is a KMP array. This gives a method for computing all the distinct KMP arrays.
متن کاملOntology Based Rule Acquisition from similar Web with Knuth Morris Pratt Algorithm
Rule acquisition is also an important issue, and the Web that implies inferential rules can be a major source of rule acquisition. It is not easier to acquire rules from a site by using similar rules of other sites in the same domain. Here it proposed an automatic rule acquisition procedure using an ontology, named RuleToOnto, that includes information about the rule components and their struct...
متن کاملProgramming by Expression Refinement: the KMP Algorithm
The exercise is to calculate a pattern-matching algorithm, and specifically the algorithm originally due to Knuth, Morris, and Pratt [0]. We begin, however, with a smaller problem, one that turns out to be both similar to, and a subproblem of, the larger problem. We prefer to start with this because it will give the reader a chance to become familiar in a simple setting with the style and notat...
متن کامل